全文获取类型
收费全文 | 12752篇 |
免费 | 1518篇 |
国内免费 | 768篇 |
专业分类
化学 | 4205篇 |
晶体学 | 32篇 |
力学 | 801篇 |
综合类 | 327篇 |
数学 | 7104篇 |
物理学 | 2569篇 |
出版年
2024年 | 14篇 |
2023年 | 198篇 |
2022年 | 349篇 |
2021年 | 439篇 |
2020年 | 578篇 |
2019年 | 474篇 |
2018年 | 448篇 |
2017年 | 535篇 |
2016年 | 527篇 |
2015年 | 433篇 |
2014年 | 637篇 |
2013年 | 896篇 |
2012年 | 673篇 |
2011年 | 740篇 |
2010年 | 677篇 |
2009年 | 904篇 |
2008年 | 806篇 |
2007年 | 719篇 |
2006年 | 732篇 |
2005年 | 570篇 |
2004年 | 519篇 |
2003年 | 443篇 |
2002年 | 391篇 |
2001年 | 332篇 |
2000年 | 323篇 |
1999年 | 283篇 |
1998年 | 270篇 |
1997年 | 188篇 |
1996年 | 136篇 |
1995年 | 154篇 |
1994年 | 120篇 |
1993年 | 95篇 |
1992年 | 84篇 |
1991年 | 49篇 |
1990年 | 41篇 |
1989年 | 39篇 |
1988年 | 29篇 |
1987年 | 25篇 |
1986年 | 20篇 |
1985年 | 38篇 |
1984年 | 28篇 |
1983年 | 8篇 |
1982年 | 18篇 |
1981年 | 6篇 |
1980年 | 9篇 |
1979年 | 14篇 |
1978年 | 5篇 |
1977年 | 8篇 |
1976年 | 6篇 |
1974年 | 3篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
61.
S. Aravinda N. Shamala Rituparna S. Roy P Balaram 《Journal of Chemical Sciences》2003,115(5-6):373-400
An overview of the use of non-protein amino acids in the design of conformationally well-defined peptides, based on work from
the author’s laboratory, is discussed. The crystal structures of several designed oligopeptides illustrate the useα-aminoisobutyric acid (Aib) in the construction of helices, D-amino acids in the design of helix termination segments andDPro-Xxx segments for nucleating ofβ-hairpin structures.β- andγ-amino acid residues have been used to expand the range of designed polypeptide structures.
Dedicated to Professor C N R Rao on his 70th birthday 相似文献
62.
两段级联掺铒光纤放大器的优化研究 总被引:7,自引:4,他引:3
基于Giles模型,研究了980 nm和1480 nm泵浦的两段级联掺铒光纤放大器(EDFA)的设计,得出了掺铒光纤(EDF)的最佳长度和光隔离器的最佳位置随泵浦功率和信号功率的变化关系.比较980 nm和1480 nm泵浦的两段级联EDFA,可以发现,前者的最佳EDF长度短,而光隔离器最佳位置距EDFA输入端远. 相似文献
63.
Yao Ping HOU 《数学学报(英文版)》2005,21(4):955-960
A signed graph is a graph with a sign attached to each edge. This paper extends some fundamental concepts of the Laplacian matrices from graphs to signed graphs. In particular, the relationships between the least Laplacian eigenvalue and the unbalancedness of a signed graph are investigated. 相似文献
64.
HANXI'AN HUANGXILI 《高校应用数学学报(英文版)》1998,13(4):445-450
For two rational quadratic B-spline curves with same control vertexes, the cross ratio of four eollinear points are represented; which are any one of the vertexes, and the two points that the ray initialing from the vertex intersects with the corresponding segments of the twocurves, and the point the ray intersecting with the connecting line between the two neighboring vertexes. Different from rational quadratic Beeier curves, the value is generally related with the loeation of the ray, and the necessary and sufficient condition o5 the ratio being independent of the ray‘s loeation is showed. Alsn another cross ratio o5 the following four collinear points are suggested, i.e. one vertex, the points that the ray from the initlal vertex intersects respectivdy with the curve segmentt the line connecting the segments end points, and the line connecting the two neighboring vertexes. This cross ratio is concerned only whh the ray‘s location, butnot with the weights of the curve. Furthermore, the cross ratio is projective invariant under the projective transformation between the two segments. 相似文献
65.
优化设计性实验教学培养学生的科学素质 总被引:13,自引:2,他引:11
通过论证设计性实验与科学素质之间的关系,提出体现培养科学素质的问题式学习模式,并在大学物理实验教学中进行了教学改革试验。 相似文献
66.
For given a graph H, a graphic sequence π = (d
1, d
2,..., d
n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K
5 − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to
be potentially K
5-graphic, where K
r is a complete graph on r vertices and K
r-e is a graph obtained from K
r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence
π to be potentially K
6-graphic.
Project supported by National Natural Science Foundation of China (No. 10401010). 相似文献
67.
In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon. 相似文献
68.
主要介绍了丝绸之路上多元文化的典型代表——艾德莱斯绸.文章重点介绍了艾德莱斯绸的历史和传说,扎经染色工艺,各类艾德莱斯绸的特点及典型的艾德莱斯绸图案. 相似文献
69.
70.